GATE CSE 2021 SET-2
Q21.
Which of the following statement(s) is/are correct in the context of CPU scheduling?[MSQ]Q22.
Consider a network using the pure ALOHA medium access control protocol, where each frame is of length 1,000 bits. The channel transmission rate is 1 Mbps (=10^6 bits per second). The aggregate number of transmissions across all the nodes (including new frame transmissions and retransmitted frames due to collisions) is modelled as a Poisson process with a rate of 1,000 frames per second. Throughput is defined as the average number of frames successfully transmitted per second. The throughput of the network (rounded to the nearest integer) is ______________Q23.
Consider the cyclic redundancy check (CRC) based error detecting scheme having the generator polynomial X^3+X+1. Suppose the message m_4m_3m_2m_1m_0=11000 is to be transmitted. Check bits c_2c_1c_0 are appended at the end of the message by the transmitter using the above CRC scheme. The transmitted bit string is denoted by m_4m_3m_2m_1m_0c_2c_1c_0. The value of the checkbit sequence c_2c_1c_0 isQ24.
Consider a Boolean function f(w,x,y,z) such that \begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array} The number of literals in the minimal sum-of-products expression of f is ________Q25.
Consider the following sets, where n\geq 2: S1: Set of all nxn matrices with entries from the set \{a, b, c\} S2: Set of all functions from the set\{0,1,2,...,n^2-1\} to the set \{0, 1, 2 \} Which of the following choice(s) is/are correct?[MSQ]Q26.
Consider the following directed graph: Which of the following is/are correct about the graph?[MSQ]Q27.
In a directed acyclic graph with a source vertex s, the quality-score of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex v other than s, the quality-score of v is defined to be the maximum among the quality-scores of all the paths from s to v. The quality-score of s is assumed to be 1. The sum of the quality-scores of all vertices on the graph shown above is ______Q28.
Consider the following ANSI C program #include < stdio.h > int foo(int x, int y, int q) { if ((x < = 0) && (y < = 0)) return q; if (x < = 0) return foo(x, y-q, q); if (y < = 0) return foo(x-q, y, q); return foo(x, y-q, q) + foo(x-q, y, q); } int main( ) { int r = foo(15, 15, 10); printf("%d", r); return 0; } The output of the program upon execution is ____Q29.
Consider the following ANSI C function:int SomeFunction (int x, int y) { if ((x==1) || (y==1)) return 1; if (x==y) return x; if (x > y) return SomeFunction(x-y, y); if (y > x) return SomeFunction (x, y-x); } The value returned by SomeFunction(15, 255) is __________Q30.
Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H?